An Improved Scoring Matrix for Multiple Sequence Alignment

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Scoring Matrix for Multiple Sequence Alignment

The way for performing multiple sequence alignment is based on the criterion of the maximum scored information content computed from a weight matrix, but it is possible to have two or more alignments to have the same highest score leading to ambiguities in selecting the best alignment. This paper addresses this issue by introducing the concept of joint weight matrix to eliminate the randomness ...

متن کامل

IBBOMSA: An Improved Biogeography-based Approach for Multiple Sequence Alignment

In bioinformatics, multiple sequence alignment (MSA) is an NP-hard problem. Hence, nature-inspired techniques can better approximate the solution. In the current study, a novel biogeography-based optimization (NBBO) is proposed to solve an MSA problem. The biogeography-based optimization (BBO) is a new paradigm for optimization. But, there exists some deficiencies in solving complicated problem...

متن کامل

An Improved Genetic Algorithm for Multiple Sequence Alignment

In this project we applied Genetic Algorithm (GA) to solve the problem of Multiple Sequence Alignment (MSA). MSA is one of the most useful tools in bioinformatics. It is widely used to identify conservation of protein domains, RNA secondary structure and classification of biological sequences. However, it is recognized as one of the most challenging tasks in bioinformatics. Most formulations of...

متن کامل

An Improved Search Algorithm for Optimal Multiple-Sequence Alignment

Multiple sequence alignment (MSA) is a ubiquitous problem in computational biology. Although it is NP -hard to find an optimal solution for an arbitrary number of sequences, due to the importance of this problem researchers are trying to push the limits of exact algorithms further. Since MSA can be cast as a classical path finding problem, it is attracting a growing number of AI researchers int...

متن کامل

Gap Profiling: Scoring Indels in Multiple Sequence Alignment

Cory L. Strope Computer Science and Engineering University of Nebraska Lincoln, Nebraska 68588–0115 Email: [email protected] Stephen D. Scott Computer Science and Engineering University of Nebraska Lincoln, Nebraska 68588–0115 Email: [email protected] Etsuko N. Moriyama School of Biological Sciences, Center for Plant Science Innovation University of Nebraska Lincoln, Nebraska 68588–0660 Ema...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2012

ISSN: 1024-123X,1563-5147

DOI: 10.1155/2012/490649